Search results for "Arbitrarily large"
showing 10 items of 12 documents
Semiclassical Methods for the Description of Large Metal Clusters
1996
One of the most fascinating aspects of clusters is that they can be made arbitrarily large and therefore provide links between the microscopic and the macroscopic world. It is challenging to study how their physical properties change when going from atoms and small molecules to the bulk limit of condensed matter. But also the models and mathematical tools themselves, which are used in order to tackle the many-body problem, are an object of study for the theoretician. In particular, the question of how far quantum-mechanics must be carried with increasing size and where classical pictures become appropriate is of great interest. In this spirit, we discuss here some semiclassical methods for …
Convergence of KAM iterations for counterterm problems
1998
Abstract We analyse two iterative KAM methods for counterterm problems for finite-dimensional matrices. The starting point for these methods is the KAM iteration for Hamiltonians linear in the action variable in classical mechanics. We compare their convergence properties when a perturbation parameter is varied. The first method has no fixed points beyond a critical value of the perturbation parameter. The second one has fixed points for arbitrarily large perturbations. We observe different domains of attraction separated by Julia sets.
Upper bounds for the tightness of the $$G_\delta $$-topology
2021
We prove that if X is a regular space with no uncountable free sequences, then the tightness of its $$G_\delta $$ topology is at most the continuum and if X is, in addition, assumed to be Lindelof then its $$G_\delta $$ topology contains no free sequences of length larger then the continuum. We also show that, surprisingly, the higher cardinal generalization of our theorem does not hold, by constructing a regular space with no free sequences of length larger than $$\omega _1$$ , but whose $$G_\delta $$ topology can have arbitrarily large tightness.
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…
On the stability of bifurcation branches in thermal ignition
1984
A method is given to determine the stability of stationary solutions of the thermal ignition equation for the case ofn-dimensional spherical symmetry, together with the number of unstable modes. For sufficiently high temperature and activation temperature this number is arbitrarily large. Some numerical results on the solutions and their stability are reported.
Transition state ensemble optimization for reactions of arbitrary complexity.
2015
In the present work, we use Variational Transition State Theory (VTST) to develop a practical method for transition state ensemble optimization by looking for an optimal hyperplanar dividing surface in a space of meaningful trial collective variables. These might be interatomic distances, angles, electrostatic potentials, etc. Restrained molecular dynamics simulations are used to obtain on-the-fly estimates of ensemble averages that guide the variations of the hyperplane maximizing the transmission coefficient. A central result of our work is an expression that quantitatively estimates the importance of the coordinates used for the localization of the transition state ensemble. Starting fro…
Inclusive Search for Squark and Gluino Production inpp¯Collisions ats=1.96 TeV
2009
We report on a search for inclusive production of squarks and gluinos in p{bar p} collisions at {radical}s = 1.96 TeV, in events with large missing transverse energy and multiple jets of hadrons in the final state. The study uses a CDF Run II data sample corresponding to 2 fb-1 of integrated luminosity. The data are in good agreement with the standard model predictions, giving no evidence for any squark or gluino component. In an R-parity conserving minimal supergravity scenario with A{sub 0} = 0, mu < 0 and tan beta = 5, 95% C.L. upper limits on the production cross sections in the range between 0.1 pb and 1 pb are obtained, depending on the squark and gluino masses considered. For gluino …
On Using the Theory of Regular Functions to Prove the ε-Optimality of the Continuous Pursuit Learning Automaton
2013
Published version of a chapter in the book: Recent Trends in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-38577-3_27 There are various families of Learning Automata (LA) such as Fixed Structure, Variable Structure, Discretized etc. Informally, if the environment is stationary, their ε-optimality is defined as their ability to converge to the optimal action with an arbitrarily large probability, if the learning parameter is sufficiently small/large. Of these LA families, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. The…
Entanglement replication in driven-dissipative many body systems
2012
We study the dissipative dynamics of two independent arrays of many-body systems, locally driven by a common entangled field. We show that in the steady state the entanglement of the driving field is reproduced in an arbitrarily large series of inter-array entangled pairs over all distances. Local nonclassical driving thus realizes a scale-free entanglement replication and long-distance entanglement distribution mechanism that has immediate bearing on the implementation of quantum communication networks.
Analysis of a parabolic cross-diffusion population model without self-diffusion
2006
Abstract The global existence of non-negative weak solutions to a strongly coupled parabolic system arising in population dynamics is shown. The cross-diffusion terms are allowed to be arbitrarily large, whereas the self-diffusion terms are assumed to disappear. The last assumption complicates the analysis since these terms usually provide H 1 estimates of the solutions. The existence proof is based on a positivity-preserving backward Euler–Galerkin approximation, discrete entropy estimates, and L 1 weak compactness arguments. Furthermore, employing the entropy–entropy production method, we show for special stationary solutions that the transient solution converges exponentially fast to its…